Contracting a Chordal Graph to a Split Graph or a Tree
نویسندگان
چکیده
The problems Contractibility and Induced Minor are to test whether a graph G contains a graph H as a contraction or as an induced minor, respectively. We show that these two problems can be solved in |VG|H |) time if G is a chordal input graph and H is a split graph or a tree. In contrast, we show that containment relations extending Subgraph Isomorphism can be solved in linear time if G is a chordal input graph and H is an arbitrary graph not part of the input.
منابع مشابه
Bounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کاملTree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems
A tree t-spanner T in a graph G is a spanning tree of G such that the distance in T between every pair of vertices is at most t times their distance in G. The Tree t-Spanner problem asks whether a graph admits a tree t-spanner, given t. We substantially strengthen the hardness result of Cai and Corneil [SIAM J. Discrete Math. 8 (1995) 359– 387] by showing that, for any t ≥ 4, Tree t-Spanner is ...
متن کاملTree spanners on chordal graphs: complexity and algorithms
A tree t-spanner T in a graph G is a spanning tree of G such that the distance in T between every pair of vertices is at most t times their distance in G. The TREE t-SPANNER problem asks whether a graph admits a tree t-spanner, given t. We substantially strengthen the hardness result of Cai and Corneil (SIAM J. Discrete Math. 8 (1995) 359–387) by showing that, for any t¿ 4, TREE t-SPANNER is NP...
متن کاملVertex partitions of chordal graphs
A k-tree is a chordal graph with no (k + 2)-clique. An l-treepartition of a graph G is a vertex partition of G into ‘bags’, such that contracting each bag to a single vertex gives an l-tree (after deleting loops and replacing parallel edges by a single edge). We prove that for all k ≥ l ≥ 0, every k-tree has an l-tree-partition in which every bag induces a connected ⌊k/(l + 1)⌋-tree. An analogo...
متن کاملOn Chordal-k-Generalized Split Graphs
A graph G is a chordal-k-generalized split graph if G is chordal and there is a clique Q in G such that every connected component in G[V \ Q] has at most k vertices. Thus, chordal-1-generalized split graphs are exactly the split graphs. We characterize chordal-k-generalized split graphs by forbidden induced subgraphs. Moreover, we characterize a very special case of chordal-2-generalized split ...
متن کامل